منابع مشابه
Impossibility of SNARGs∗
In the last few years, applications such practical verifiable computation, anonymous cryptocurrencies (e.g. Zcash), signature of knowledge and etc have made succinct non-interactive arguments (SNARGs) as an active research area for ground-breaking researchers. A non-interactive computationally sound argument (proof system) for NP is succinct if the its proof size is polylogarithmic the instance...
متن کامل“Fair marriages”: An impossibility
Article history: Received 6 October 2008 Received in revised form 27 May 2009 Accepted 10 June 2009 Available online 21 June 2009
متن کاملThinking Algorithmically About Impossibility∗
Complexity lower bounds like P 6= NP assert impossibility results for all possible programs of some restricted form. As there are presently enormous gaps in our lower bound knowledge, a central question on the minds of today’s complexity theorists is how will we find better ways to reason about all efficient programs? I argue that some progress can be made by (very deliberately) thinking algori...
متن کاملImpossibility in Belief Merging
With the aim of studying social properties of belief merging and having a better understanding of impossibility, we extend in three ways the framework of logic-based merging introduced by Konieczny and Pino Pérez. First, at the level of representation of the information, we pass from belief bases to complex epistemic states. Second, the profiles are represented as functions of finite societies ...
متن کاملArrow’s Impossibility Theorem
Let A, B′ be non empty sets, let B be a non empty subset of B ′, let f be a function from A into B, and let x be an element of A. Then f(x) is an element of B. Next we state two propositions: (1) For every finite set A such that cardA ≥ 2 and for every element a of A there exists an element b of A such that b 6= a. (2) Let A be a finite set. Suppose cardA ≥ 3. Let a, b be elements of A. Then th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Studies
سال: 2006
ISSN: 0031-8116,1573-0883
DOI: 10.1007/s11098-005-4282-1